Finite Horizon Economic Lot and Delivery Scheduling Problem: Flexible Flow Lines with Unrelated Parallel Machines and Sequence Dependent Setups

Authors

  • M. Jenabi Industrial Engineering, Amirkabir University of Technology
Abstract:

This paper considers the economic lot and delivery scheduling problem in a two-echelon supply chains, where a single supplier produces multiple components on a flexible flow line (FFL) and delivers them directly to an assembly facility (AF). The objective is to determine a cyclic schedule that minimizes the sum of transportation, setup and inventory holding costs per unit time without shortage. We have developed a new mixed zero-one nonlinear mathematical model for theproblem. Due to the difficulty of obtaining the optimal solution, especially in the instances of medium and large-sized problems, two meta-heuristic algorithms (HGA and SA) are proposed and evaluatedover randomly generated problems. Computational results indicate that the proposed HGA outperforms the SA algorithm with respect to both the solution quality and computation times especially in large-size problems.

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

The Finite Horizon Economic Lot Scheduling in Flexible Flow Lines

This paper addresses the common cycle multi-product lot-scheduling problem in flexible flow lines (FFL) where the product demands are deterministic and constant over a finite planning horizon. Objective is minimizing the sum of setup costs, work-in-process and final products inventory holding costs per time unite while satisfying the demands without backlogging. This problem consists of a combi...

full text

The Economic Lot Scheduling Problem in Flow Lines with Sequence-Dependent Setups

  The problem of lot sizing, sequencing and scheduling multiple products in flow line production systems has been studied by several authors. Almost all of the researches in this area assumed that setup times and costs are sequence –independent even though sequence dependent setups are common in practice. In this paper we present a new mixed integer non linear program (MINLP) and a heuristic me...

full text

the economic lot scheduling problem in flow lines with sequence-dependent setups

the problem of lot sizing, sequencing and scheduling multiple products in flow line production systems has been studied by several authors. almost all of the researches in this area assumed that setup times and costs are sequence –independent even though sequence dependent setups are common in practice. in this paper we present a new mixed integer non linear program (minlp) and a heuristic meth...

full text

The Economic Lot Scheduling Problem in Flow Lines with Sequence-Dependent Setups

The problem of lot sizing, sequencing and scheduling multiple products in flow line production systems has been studied by several authors. Almost all of the researches in this area assumed that setup times and costs are sequence –independent even though sequence dependent setups are common in practice. In this paper we present a new mixed integer non linear program (MINLP) and a heuristic meth...

full text

Scheduling unrelated parallel machines with sequence-dependent setups

A methodology for minimizing the weighted tardiness of jobs in unrelated parallel machining scheduling with sequence-dependent setups is presented in this paper. To comply with industrial situations, the dynamic release of jobs and dynamic availability of machines are assumed. Recognizing the inherent difficulty in solving industrial-size problems efficiently, six different search algorithms ba...

full text

My Resources

Save resource for easier access later

Save to my library Already added to my library

{@ msg_add @}


Journal title

volume 21  issue 2

pages  143- 158

publication date 2008-06-01

By following a journal you will be notified via email when a new issue of this journal is published.

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023